package imooc_math;

import java.util.Arrays;

import resource.SortTestHelper;

public class Test {
public static void main(String[] args) {
	int n=10000;
	int swapTimes=10;
	//Integer[] arry=new  SortTestHelper().generateRandomArray(n,0,3000);
	//近乎有序的数组
	//Integer[] arry=new  SortTestHelper().generateNearlyOrderedArray(n, swapTimes);
	//拥有很多的相同的值
	Integer[] arry=new  SortTestHelper().generateRandomArray(n,0,5);
	SortTestHelper sth=new SortTestHelper();
	Integer[] arryCopy=Arrays.copyOf(arry,arry.length);
	Integer[] arryCopy1=Arrays.copyOf(arry,arry.length);
	
	sth.testSort("imooc_math.MergeSort", arry);
	//sth.testSort("imooc_math.QuickSort", arryCopy);
	//sth.testSort("imooc_math.QuickSort2Way", arryCopy);
	sth.testSort("imooc_math.QuickSort3Way", arryCopy);
	sth.testSort("imooc_math.HeapSort", arryCopy1);
}
}
